منابع مشابه
Finitely Representable Nested Relations
Advanced temporal and spatial applications require both the representation of complex objects and the ability to nitely represent innnite relations. Representing such data requires combining the constraint relational model (allowing nite representation of innnite information) and either the nested relational or the object-oriented model (allowing representation of complex objects). In this pape...
متن کاملFinitely Representable Databasesy
We study infinite but finitely representable databases based on constraints, motivated by new database applications such as those involving spatio-temporal information. We introduce a general definition of finite representation, and define the concept of a query as a generalization of a query over relational databases. We investigate the theory of finitely representable models and prove that it...
متن کاملFinitely Representable Databases Y St Ephane Grumbach
We study classes of innnite but nitely representable databases based on constraints , motivated by new database applications such as geographical databases. We formally deene these notions and introduce the concept of query which generalizes queries over classical relational databases. We prove that in this context the basic properties of queries (satissability, containment, equivalence, etc.) ...
متن کاملFinitely Representable Databases St Ephane Grumbach
We study classes of innnite but nitely representable databases based on constraints, motivated by new database applications such as geographical databases. The mathematical framework is based on classical decidable rst-order theories. We investigate the theory of nitely representable models and prove that it diiers strongly from both classical model theory and nite model theory. In particular, ...
متن کاملThe Isomorphism Testing for Directly Representable Varieties
• Abelian groups with nx = 0, n > 0, • Boolean algebras, • Rings with x = x, m > 1, • Modules over a finite semisimple ring. An isomorphism testing problem for a class K of structures (K–Iso) is to determine the exact computational complexity of the following problem: INSTANCE: Two finite structures from K. QUESTION: Is there an isomorphism between them ? Received May 14, 1997 Research supporte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1983
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1983-0718976-1